Description-oriented community detection using exhaustive subgroup discovery

نویسندگان

  • Martin Atzmüller
  • Stephan Doerfel
  • Folke Mitzlaff
چکیده

Communities can intuitively be defined as subsets of nodes of a graph with a dense structure in the corresponding subgraph. However, for mining such communities usually only structural aspects are taken into account. Typically, no concise nor easily interpretable community description is provided. For tackling this issue, this paper focuses on description-oriented community detection using subgroup discovery. In order to provide both structurally valid and interpretable communities we utilize the graph structure as well as additional descriptive features of the graph’s nodes. A descriptive community pattern built upon these features then describes and identifies a community, i. e., a set of nodes, and vice versa. Essentially, we mine patterns in the “description space” characterizing interesting sets of nodes (i. e., subgroups) in the “graph space”; the interestingness of a community is evaluated by a selectable quality measure. We aim at identifying communities according to standard community quality measures, while providing characteristic descriptions of these communities at the same time. For this task, we propose several optimistic estimates of standard community quality functions to be used for efficient pruning of the search space in an exhaustive branch-and-bound algorithm. We demonstrate our approach in an evaluation using five real-world data sets, obtained from three different social media applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Description-Oriented Community Detection using Subgroup Discovery

Communities can intuitively be defined as subsets of nodes of a graph with a dense structure. However, for mining such communities usually only structural aspects are taken into account. Typically, no concise and easily interpretable community description is provided. For tackling this issue, we focus on fast description-oriented community detection using subgroup discovery, cf. [1, 2]. In orde...

متن کامل

Subgroup and Community Analytics on Attributed Graphs

Subgroup discovery and community detection are two approaches having been studied in different research areas like data mining and social network analysis. In this context, these techniques are especially helpful in order to provide for analytical and explorative data mining approaches. We present an organized picture of recent research in subgroup discovery and community detection specifically...

متن کامل

Descriptive Community Detection

Subgroup discovery and community detection are standard approaches for identifying (cohesive) subgroups. This paper presents an organized picture of recent research in descriptive community (and subgroup) detection. Here, it summarizes approaches for the identification of descriptive patterns targeting both static as well as dynamic (sequential) relations. We specifically focus on attributed gr...

متن کامل

SD-Map - A Fast Algorithm for Exhaustive Subgroup Discovery

In this paper we present the novel SD-Map algorithm for exhaustive but efficient subgroup discovery. SD-Map guarantees to identify all interesting subgroup patterns contained in a data set, in contrast to heuristic or samplingbased methods. The SD-Map algorithm utilizes the well-known FP-growth method for mining association rules with adaptations for the subgroup discovery task. We show how SD-...

متن کامل

Scalable Semantic Web Service Discovery for Goal-driven Service-Oriented Architectures

The concept of Service-Oriented Architectures (SOA) is the latest design paradigm for IT systems. The idea is to use Web services as the basic blocks, which provide programmatic access to computational facilities over the Internet. The aim is to exploit the potential of the World Wide Web as an infrastructure for computation, help to reduce the development and maintenance costs of IT systems, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 329  شماره 

صفحات  -

تاریخ انتشار 2016